Software testing on e-learning Madrasahs using Blackbox testing
نویسندگان
چکیده
منابع مشابه
Distributed Black-Box Software Testing Using Negative Selection
In the software development process, testing is one of the most human intensive steps. Many researchers try to automate test case generation to reduce the manual labor of this step. Negative selection is a famous algorithm in the field of Artificial Immune System (AIS) and many different applications has been developed using its idea. In this paper we have designed a new algorithm based on nega...
متن کاملTesting E-Learning Websites
Testing e-learning websites may provide an insight to characteristics that are useful and others that are not so useful to the users. From a technical or systems development perspective, such understanding may not be known till it is finally tested and used by the users. Therefore this research aims to explore the effectiveness of e-learning websites in relation to user’s perceptions (either po...
متن کاملA Testing Methodology for an Open Software E-learning Platform
This paper presents an outline of a methodology for the test of an open software e-learning platform. The methodology includes a test generation method from UML descriptions, in particular Sequence, Activity, Class diagrams and Navigation maps. It also includes data modelling proposing two approaches: one based on OCL and the other on UML profiles. The studied open software e-learning platform ...
متن کاملUsability testing methods on e-learning environment
At the Budapest University of Technology and Economics (BUTE) in the Institute of Applied Pedagogy and Psychology (APPI) we started to use Moodle open source course management system in 2006. Formerly we served the curricula by using workbooks, multimedia CD-s, course-books, but due to the fast change of curricula it was a hard task to keep the hard copy of learning materials up-to-date. Later ...
متن کاملAlgebraic Independence and Blackbox Identity Testing
Algebraic independence is a fundamental notion in commutative algebra that generalizes independence of linear polynomials. Polynomials {f1, . . . , fm} ⊂ K[x1, . . . , xn] (over a field K) are called algebraically independent if there is no non-zero polynomial F such that F (f1, . . . , fm) = 0. The transcendence degree, trdeg{f1, . . . , fm}, is the maximal number r of algebraically independen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2021
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/1073/1/012065